Computational problem - PDFSEARCH.IO - Document Search Engine

Computational problem
Results: 1172

#	Item
291	Online Computation with Advice Yuval Emek1 ? , Pierre Fraigniaud2 ?? , Amos Korman2 Add to Reading List Source URL: www.liafa.jussieu.fr Language: English - Date: 2010-02-08 08:39:17 Computational complexity theory Applied mathematics Competitive analysis K-server problem Randomized algorithm Metrical task system Adversary model Minimum spanning tree Bin packing problem Theoretical computer science Online algorithms Analysis of algorithms
292	Chapter 1 Introduction Let f be Boolean function from nite binary strings to the set f0; 1g. The basic question of complexity theory is what computational resources are needed to compute f (x) for an arbitrary n-bit str Add to Reading List Source URL: www.nada.kth.se Language: English - Date: 2011-01-05 06:16:54 Circuit complexity Complexity classes Parity function ACC0 Switching lemma NC Clique problem Boolean circuit Circuit Theoretical computer science Computational complexity theory Applied mathematics
293	Minding your p’s and q’s Ross Anderson1 , Serge Vaudenay2 1 Computer Laboratory, Pembroke Street, Cambridge, CB2 3QG, England Ecole Normal Sup´erieure — DMI, 45 rue d’Ulm, 75230 Paris, France Add to Reading List Source URL: book.huihoo.com Language: English - Date: 2006-07-27 09:21:33 Cryptographic protocols Public-key cryptography Diffie–Hellman problem Diffie–Hellman key exchange XTR Discrete logarithm ElGamal encryption Subliminal channels RSA Cryptography Computational hardness assumptions Finite fields
294	Z3 Lab exercises Leonardo de Moura and Nikolaj Bjørner Microsoft Research, One Microsoft Way, Redmond, WA, 98074, USA {leonardo, nbjorner}@microsoft.com June 18, 2008 Add to Reading List Source URL: leodemoura.github.io Language: English - Date: 2015-05-19 13:22:05 Computational complexity theory Recreational mathematics Z3 Gray code Eight queens puzzle Sudoku Constraint satisfaction Bit array Longest path problem Mathematics Theoretical computer science NP-complete problems
295	Asymptotic Optimality in Sampling-based Motion Planning Sertac Karaman Although one of the fundamental problems in robotics, the motion planning problem is inherently hard from a computational point of view. In particula Add to Reading List Source URL: iros2011.org Language: English - Date: 2011-09-21 07:00:30 Robot control Search algorithms Rapidly-exploring random tree Motion planning Algorithm Asymptotic computational complexity Asymptotically optimal algorithm Probabilistic roadmap Shortest path problem Applied mathematics Mathematics Theoretical computer science
296	Theoretical Justification of Popular Link Prediction Heuristics Purnamrita Sarkar Carnegie Mellon University Deepayan Chakrabarti Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2011-03-01 02:05:39 Network theory Shortest path problem Randomized algorithm Connectivity Graph theory Networks Theoretical computer science Mathematics Computational complexity theory
297	Formal Certification of Code-Based Cryptographic Proofs GILLES BARTHE and SANTIAGO ZANELLA BEGUELIN IMDEA Software, Madrid, Spain and BENJAMIN GREGOIRE Add to Reading List Source URL: certicrypt.gforge.inria.fr Language: English - Date: 2013-06-17 13:32:36 ElGamal encryption Public-key cryptography Ciphertext indistinguishability Diffie–Hellman problem Decisional Diffie–Hellman assumption Optimal asymmetric encryption padding Cramer–Shoup cryptosystem Cryptography Computational hardness assumptions Finite fields
298	This is a Chapter from the Handbook of Applied Cryptography, by A. Menezes, P. van Oorschot, and S. Vanstone, CRC Press, 1996. For further information, see www.cacr.math.uwaterloo.ca/hac CRC Press has granted the followi Add to Reading List Source URL: cacr.uwaterloo.ca Language: English - Date: 2011-07-10 02:35:13 FEAL Lecture Notes in Computer Science International Cryptology Conference Computational hardness assumptions Cryptographic protocols Diffie–Hellman problem Index of cryptography articles Cryptography LOKI Data Encryption Standard
299	Computational Rationalization: The Inverse Equilibrium Problem Kevin Waugh Brian D. Ziebart J. Andrew Bagnell Carnegie Mellon University, 5000 Forbes Ave, Pittsburgh, PA, USA 15213 Add to Reading List Source URL: www.icml-2011.org Language: English - Date: 2011-06-01 14:49:36 Metalogic Model theory Principle of maximum entropy Maximum likelihood Statistics Statistical theory Probability and statistics
300	Algorithms Lecture 4: Efficient Exponential-Time Algorithms [Fa’14] Wouldn’t the sentence “I want to put a hyphen between the words Fish and And and And and Chips in my Fish-And-Chips sign.” have been clearer if Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 09:02:22 NP-complete problems Analysis of algorithms Graph coloring Graph theory Time complexity Boolean satisfiability problem Randomized algorithm MAXEkSAT One-in-three 3SAT Theoretical computer science Computational complexity theory Mathematics

UPDATE